-
1 производивший поиск
дерево поиска; дерево перебора — searching tree
Авиация и космонавтика. Русско-английский словарь > производивший поиск
-
2 производящий поиск
дерево поиска; дерево перебора — searching tree
Авиация и космонавтика. Русско-английский словарь > производящий поиск
-
3 поиск
[lang name="Russian"]дерево поиска; дерево перебора — searching tree
-
4 инструмент поиска
дерево поиска; дерево перебора — searching tree
Русско-английский словарь по информационным технологиям > инструмент поиска
-
5 дерево поиска
-
6 дерево перебора
1. search treeдерево поиска; дерево перебора — searching tree
дерево посика; дерево перебора — search tree
2. searching tree -
7 поиск
-
8 поиск
1. look2. scan3. scanning4. tracing5. hunting6. look-upкоманда просмотра; команда поиска — look-up instruction
7. lookupтабличный поиск; поиск по таблице; обращение к таблице — table lookup
8. pursuit9. questing10. quests11. retrievalдиапазонный поиск; поиск в диапазоне — range retrieval
12. retrieving13. search forпоиск максимума; поиск максимального числа — maximum search
информационный поиск; поиск информации — information search
14. searchingдерево поиска; дерево перебора — searching tree
15. seekвремя поиска; время установки — seek time
16. seeking17. search; quest18. huntскрытое преследование, поиски дичи — still hunt
19. questСинонимический ряд:1. разведка (сущ.) разведка2. розыск (сущ.) отыскивание; разыскивание; розыск -
9 дерево перебора
1) Engineering: search treble, searching treble2) Information technology: search tree, searching tree -
10 дерево поиска
1) Engineering: search treble, searching treble2) Information technology: searching tree3) Oil: search tree -
11 произвести поиск
Авиация и космонавтика. Русско-английский словарь > произвести поиск
-
12 дерево посика
1. search tree2. searching tree -
13 поиск по дереву
tree search, tree searching -
14 поиск по дереву
tree search, tree searchingРусско-английский словарь по радиоэлектронике > поиск по дереву
-
15 поиск по дереву
1) Engineering: tree search (вариантов)2) Information technology: tree walking3) Oil: tree search4) Programming: tree searching5) Makarov: tree search (графа) -
16 игра поиск по дереву
Mathematics: tree searching gameУниверсальный русско-английский словарь > игра поиск по дереву
-
17 игра поиск на дереве
Mathematics: tree searching gameУниверсальный русско-английский словарь > игра поиск на дереве
-
18 поиск по бинарному дереву
Mathematics: binary tree searchingУниверсальный русско-английский словарь > поиск по бинарному дереву
См. также в других словарях:
Tree rearrangement — Tree rearrangements are used in heuristic algorithms devoted to searching for an optimal tree structure. They can be applied to any set of data that are naturally arranged into a tree, but have most applications in computational phylogenetics,… … Wikipedia
Searching — and search can refer to the following:In computing and mathematics, * Search algorithm, an algorithm taking a problem as input and returning a solution to the problem, usually after evaluating a number of possible solutions * Bayesian search… … Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
Tree decomposition — A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the… … Wikipedia
R-tree — R trees are tree data structures that are similar to B trees, but are used for spatial access methods i.e., for indexing multi dimensional information; for example, the (X, Y) coordinates of geographical data. A common real world usage for an R… … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
The Joshua Tree — For other uses, see Joshua tree (disambiguation). The Joshua Tree … Wikipedia
Suffix tree — In computer science, a suffix tree (also called suffix trie, PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many… … Wikipedia
Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… … Wikipedia
Decision tree model — In computational complexity and communication complexity theories the decision tree model is the model of computation or communication in which an algorithm or communication process is considered to be basically a decision tree, i.e., a sequence… … Wikipedia
And–or tree — An and–or tree is a graphical representation of the reduction of problems (or goals) to conjunctions and disjunctions of sub problems (or sub goals). ExampleThe and or tree:represents the search space for solving the problem P, using the goal… … Wikipedia